Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic
نویسندگان
چکیده
منابع مشابه
Digraphs with Isomorphic Underlying and Domination Graphs: Pairs of Paths
A domination graph of a digraph D, dom (D), is created using thc vertex set of D and edge uv E E (dom (D)) whenever (u, z) E A (D) or (v, z) E A (D) for any other vertex z E V (D). Here, we consider directed graphs whose underlying graphs are isomorphic to their domination graphs. Specifically, digraphs are completely characterized where UG (D) is the union of two disjoint paths.
متن کاملGraphs and digraphs with all 2-factors isomorphic
We show that a digraph which contains a directed 2-factor and has minimum in-degree and out-degree at least four has two non-isomorphic directed 2-factors. As a corollary we deduce that every graph which contains a 2factor and has minimum degree at least eight has two non-isomorphic 2factors. In addition we construct: an infinite family of strongly connected 3-diregular digraphs with the proper...
متن کاملDecompositions of nearly complete digraphs into t isomorphic parts
An arc decomposition of the complete digraph DKn into t isomorphic subdigraphs is generalized to the case where the numerical divisibility condition is not satisfied. Two sets of nearly tth parts are constructively proved to be nonempty. These are the floor tth class (DKn − R)/t and the ceiling tth class (DKn + S)/t, where R and S comprise (possibly copies of) arcs whose number is the smallest ...
متن کاملA Note on Vertex Transitivity in Isomorphic Graphs
In the graph theory, two graphs are said to be isomorphic if there is a one-one, onto mapping defined between their set of vertices so as to preserving the adjacency between vertices. An isomorphism defined on a vertex set of a graph to itself is called automorphism of the given graph. Two vertices in a graph are said to be similar if there is an automorphism defined on its vertex set mapping o...
متن کاملDecomposing the vertex set of a hypercube into isomorphic subgraphs
Let G be an induced subgraph of the hypercube Qk for some k. We show that if |G| is a power of 2 then, for sufficiciently large n, the vertex set of Qn can be partitioned into induced copies of G. This answers a question of Offner. In fact, we prove a stronger statement: if X is a subset of {0, 1} for some k and if |X | is a power of 2, then, for sufficiently large n, {0, 1} can be partitioned ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2019
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil1913307b